On the Half-Space Matching Method for Real Wavenumber
نویسندگان
چکیده
منابع مشابه
Fundamental Steady state Solution for the Transversely Isotropic Half Space
Response of a transversely isotropic 3-D half-space subjected to a surface time-harmonic excitation is presented in analytical form. The derivation of the fundamental solutions expressed in terms of displacements is based on the prefect series of displacement potential functions that have been obtained in the companion paper by the authors. First the governing equations are uncoupled in the cyl...
متن کاملTime-Dependent Real-Space Renormalization Group Method
In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...
متن کاملPlane Strain Deformation of a Poroelastic Half-Space Lying Over Another Poroelastic Half-Space
The plane strain deformation of an isotropic, homogeneous, poroelastic medium caused by an inclined line-load is studied using the Biot linearized theory for fluid saturated porous materials. The analytical expressions for the displacements and stresses in the medium are obtained by applying suitable boundary conditions. The solutions are obtained analytically for the limiting case of undrained...
متن کاملA Convergent Method for Linear Half-space Kinetic Equations
We give a unified proof for the well-posedness of a class of linear half-space equations with general incoming data and construct a Galerkin method to numerically resolve this type of equations in a systematic way. Our main strategy in both analysis and numerics includes three steps: adding damping terms to the original half-space equation, using an inf-sup argument and even-odd decomposition t...
متن کاملReal-Time String Matching in Sublinear Space
We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant " > 0, a real-time string matching algorithm claiming O(m") extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use (m) extra
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Applied Mathematics
سال: 2022
ISSN: ['0036-1399', '1095-712X']
DOI: https://doi.org/10.1137/21m1459216